National Repository of Grey Literature 12 records found  1 - 10next  jump to record: Search took 0.01 seconds. 
Suggestion for the improvement of the Company´s Culture
Sombergová, Markéta ; Horák, Hynek (referee) ; Pokorný, Jiří (advisor)
This bachelor´s thesis deal with structure of internal culture of SolidVision company and its influence on the effective performance of employees. It points out the problems of the company and explains how these problems affects running of the company and effectiveness of the work. It includes suggestions, procedures and recommendations for improving the company´s culture, which can lead to the better prosperity and more effective work.
Optimal solutions and CLM sets
Semela, Ondřej ; Lachout, Petr (advisor) ; Branda, Martin (referee)
This thesis falls within the theory of optimization problems. In the first part, terms such as epi- convergence, lower and upper semicontinuous function, epi-continuity and CLM set are defined. For a better understanding, the definitions of the key terms are accompanied with illustrative examples and observations of their basic properties. The following part deals with searching of (local) minimizers of random or deterministic function. Using the knowledge from the first part it is showed that under a set of assumptions it is possible to transfer this search to a sequence of random functions of specific requirements. Powered by TCPDF (www.tcpdf.org)
A knapsack problem
Piskačová, Nikola ; Kopa, Miloš (advisor) ; Lachout, Petr (referee)
This work deals with the theory of integer programming. In the first part, there are defined the basic concepts and there are mentioned the two most used methods for solving integer problems. Namely, it is the Branch and Bound method and the Cutting Plane method. In the second chapter, there is described the Knapsack Problem and its various formulations. This problem is a special case of integer optimalization. Next, there is a practical part, where a real problem is solved. The problem is how to place the products in shelves in equipment in the most effectively way. In this chapter is described how to process input data, create a model and solve the problem. In the second part of the practical part, the basics of stochastic optimalization and solution of these problems by the Scenario method are presented. This method is used to solve the previously mentioned problem if the delivery days are random. The aim of this work is to show the applicability of formulations of Knapsack Problem and to compare the obtained results. 1
Inventory routing problem
Špolc, Miroslav ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
Inventory routing problem is a mathematical method of operations research, consisting of two basic models (vehicle routing problem and inventory allocation). The goal of this master thesis is to introduce the reader to what exactly inventory routing is, why and how it was created and how it evolved over the course of years. Also, some examples of actual real-life applications of the problem will be shown together with the results of their implementation. Researches and papers of the last almost 40 years, written by experts on the subject are used as the source for this master thesis. From these works, the summarizing thesis was written, putting together the most important knowledge on how to solve the problem. Its contribution is not just the explanation of the theory and its development, but also introduction of some real applications of Inventory routing. Applicability of the model and its positive results in the form of cost savings is shown on real examples.
Optimal solutions and CLM sets
Semela, Ondřej ; Lachout, Petr (advisor) ; Branda, Martin (referee)
This thesis falls within the theory of optimization problems. In the first part, terms such as epi- convergence, lower and upper semicontinuous function, epi-continuity and CLM set are defined. For a better understanding, the definitions of the key terms are accompanied with illustrative examples and observations of their basic properties. The following part deals with searching of (local) minimizers of random or deterministic function. Using the knowledge from the first part it is showed that under a set of assumptions it is possible to transfer this search to a sequence of random functions of specific requirements. Powered by TCPDF (www.tcpdf.org)
Suggestion for the improvement of the Company´s Culture
Sombergová, Markéta ; Horák, Hynek (referee) ; Pokorný, Jiří (advisor)
This bachelor´s thesis deal with structure of internal culture of SolidVision company and its influence on the effective performance of employees. It points out the problems of the company and explains how these problems affects running of the company and effectiveness of the work. It includes suggestions, procedures and recommendations for improving the company´s culture, which can lead to the better prosperity and more effective work.
Postoptimization analysis in parametric programming
Ten, Anastassiya ; Sekničková, Jana (advisor) ; Skočdopolová, Veronika (referee)
This bachelor thesis deals with postoptimality analysis of parametric programming problems. Parametric programming problem is problem, where some of the coefficients are not constant but depend on one or several parameters. Postoptimality analysis explores intervals of stability of coefficients in an initial solution and impact of additional changes in the assignment of the problem. Mentioned theory explains main terms and methods, which were illustrated on practical examples.
Optimizing the use of agricultural areas - a case study
Jirků, Šárka ; Kuncová, Martina (advisor) ; Kalčevová, Jana (referee)
This study deals with analysis of the agricultural company layout. The utilization of agricultural areas is optimized with such a sowing technique that leads to the highest harvest profit. All these issues are being solved by the conversion to the linear programming model which is the most resembling to the combination of production planning and allocation problem. A case study is based on actual data given by Agrofarma Týnec, s.r.o. company. The 48 sections of field in different proportion are taken in consideration as well as five different crops. The study tries to deal with more options taking in account different trade prices of set commodities and a hectare sowing limitation. The main model anticipates pessimistic trade prices expectations and does not restrict hectare sowing with single crops. The model is followed by the price coefficient analysis that gives the price level to be kept to let the computed solution be optimal. Lingo13.0 was used as an optimization software.

National Repository of Grey Literature : 12 records found   1 - 10next  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.